A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings

摘要

5 pages, 3 figures. Version 2 has been substantially expanded. Version 3 shows that the worst-case running time is sub-exponential in the number of vertices.